Computing phylogenetic trees using topologically related minimum spanning trees
نویسندگان
چکیده
منابع مشابه
Computing phylogenetic trees using topologically related minimum spanning trees
Choi et al. [2] introduced a minimum spanning tree (MST)-based method called CLGrouping, for constructing tree-structured probabilistic graphical models, a statistical framework that is commonly used for inferring phylogenetic trees. While CLGrouping works correctly if there is a unique MST, we observe an indeterminacy in the method in the case that there are multiple MSTs. We demonstrate the i...
متن کاملComputing Minimum Spanning Trees with Uncertainty
We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the graph only a set Ae, called an uncertainty area, that contains the actual edge weight we is known. The algorithm can ‘update’ e to obtain the edge weight we ∈ Ae. The task is to output the edge set of a minimum spanning tree after...
متن کاملComputing Geometric Minimum Spanning Trees Using the Filter-Kruskal Method
Let P be a set of points in R. We propose GeoFilterKruskal, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with a simple modification of Kruskal’s algorithm. When P is sampled from uniform random distribution, we show that our algorithm runs in O(n log n) time with probability at least 1−1/n for a given c > 1. Although this is th...
متن کاملStochastic Minimum Spanning Trees and Related Problems
We investigate the computational complexity of minimum spanning trees and maximum flows in a simple model of stochastic networks, where each node or edge of an undirected master graph can fail with an independent and arbitrary probability. We show that computing the expected length of the MST or the value of the max-flow is #P -Hard, but that for the MST it can be approximated within O(log n) f...
متن کاملGeometric Minimum Spanning Trees
Let S be a set of n points in < d. We present an algorithm that uses the well-separated pair decomposition and computes the minimum spanning tree of S under any Lp or polyhedral metric. It has an expected running time of O(n logn) for uniform distributions. Experimentalresults show that this approachis practical. Under a variety of input distributions, the resultingimplementation is robust and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2017
ISSN: 1526-1719
DOI: 10.7155/jgaa.00447